On cycles and the stable multi-set polytope
نویسندگان
چکیده
منابع مشابه
Gear composition and the stable set polytope
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields counterexamples to a conjecture on the facial structure of STAB(G) when G is claw-free.
متن کاملCritical Facets of the Stable Set Polytope
A facet of the stable set polytope of a graph G can be viewed as a generalization of the notion of an-critical graph. We extend several results from the theory of-critical graphs to facets. The defect of a nontrivial, full-dimensional facet P v2V a(v)x v b of the stable set polytope of a graph G is deened by = P v2V a(v) ?2b. We prove the upper bound a(u) + for the degree of any vertex u in a c...
متن کاملFormulations for the Stable Set Polytope
We give a simple algorithm for the weighted stable set problem of an arbitrary graph which yields an extended formulation for its stable set polytope The algorithm runs in polynomial time for the class of distance claw free graphs These are the graphs such that for each node neither its neighbour set nor the set of nodes at distance two contain a stable set of size three The extended formulatio...
متن کاملCritical Facets of the Stable Set Polytope
A facet of the stable set polytope of a graph G can be viewed as a generalization of the notion of an α-critical graph. We extend several results from the theory of α-critical graphs to facets. The defect of a nontrivial, full-dimensional facet ∑ v∈V a(v)xv ≤ b of the stable set polytope of a graph G is defined by δ = ∑ v∈V a(v)−2b. We prove the upper bound a(u) + δ for the degree of any node u...
متن کاملOn the Stable Set Polytope of Claw-Free Graphs
In this thesis we focus our attention on the stable set polytope of claw-free graphs. This problem has been open for many years and albeit all the efforts engaged during those last three years, it is still open. This does not mean that no progress has been made and we hope to the contrary that this thesis contains some important advances and that the reader will share this point of view. Unders...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2005
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2005.06.004